#include <bits/stdc++.h>
// 2025/01/27
// tag:
// Author: Zhang Muen
using namespace std;

int n, b, d, cnt, ans[65];

signed main()
{
    cin >> n >> b >> d;
    for (int i = 1; i <= n; i++) {
        for (int j = ans[i - 1]; j <= (1 << b) - 1; j++) {
            bool flag = true;
            for (int k = 1; k <= i - 1; k++) {
                if (__builtin_popcount(j ^ ans[k]) < d) {
                    flag = false;
                    break;
                }
            }
            if (flag) {
                ans[i] = j;
                break;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        cout << ans[i];
        if (i % 10 == 0)
            cout << endl;
        else
            cout << " ";
    }

    return 0;
}